Heavy traffic analysis for EDF queues with reneging
نویسندگان
چکیده
منابع مشابه
Heavy traffic analysis for EDF queues with reneging
This paper presents a heavy-traffic analysis of the behavior of a single-server queue under an Earliest-Deadline-First (EDF) scheduling policy, in which customers have deadlines and are served only until their deadlines elapse. The performance of the system is measured by the fraction of reneged work (the residual work lost due to elapsed deadlines), which is shown to be minimized by the EDF po...
متن کاملHeavy TraÆc Analysis for EDF Queues with Unbounded Lead Times
We present a heavy traÆc analysis for a G/G/1 queue in which customers have unbounded random deadlines correlated with their service times. The customers are processed according to the earliest-deadlinerst (EDF) queue discipline. At any time, the customers have a lead time, the time until their deadline lapses. We model the evolution of these lead times as a random measure on the real line. Und...
متن کاملQueues with deterministic reneging times
We consider single-server and multi-server queues with deterministic reneging times motivated by the timeout mechanisms used in application servers.. A Volterra integral equation is developed using the level crossing analysis for the M/G/1 queue with reneging. An analytical solution is given for the M/HyperExponential/1 queue with deterministic reneging times and a numerical approach is present...
متن کاملHeavy-traffic extreme-value limits for queues
We consider the maximum waiting time among the first n customers in the GI/G/1 queue. We use strong approximations to prove, under regularity conditions, convergence of the normalized maximum wait to the Gumbel extreme-value distribution when the traffic intensity p approaches 1 from below and n approaches infinity at a suitable rate. The normalization depends on the interarrival-time and servi...
متن کاملUniform Large Deviations for Heavy-tailed Queues under Heavy Traffic
We provide a complete large and moderate deviations asymptotic for the steady-state waiting time of a class of subexponential M/G/1 queues under heavy traffic. The asymptotic is uniform over the positive axis, and reduces to heavy-traffic asymptotics and heavy-tail asymptotics on two ends, both of which are known to be valid over restricted asymptotic regimes. The link between these two well-kn...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Applied Probability
سال: 2011
ISSN: 1050-5164
DOI: 10.1214/10-aap681